Ranking Efficient DMUs Using the Ideal point and Norms
author
Abstract:
In this paper, presenting two simple methods for ranking of efficient DMUs in DEA models that included to add one virtual DMU as ideal DMU and is using the additive model. Note that, we use an ideal point just for comparing efficient DMUs with. Although these methods are simple, they have ability for ranking all efficient DMUs, extreme points and the others, also they are capable of ranking the whole DMUs at special cases that previous methods could not ranked them or they can be ranked with hard computing
similar resources
ranking efficient dmus using the ideal point and norms
in this paper, presenting two simple methods for ranking of efficient dmus in dea models that included to add one virtual dmu as ideal dmu and is using the additive model. note that, we use an ideal point just for comparing efficient dmus with. although these methods are simple, they have ability for ranking all efficient dmus, extreme points and the others, also they are capable of ranking the...
full textRanking efficient DMUs using minimizing distance in DEA
In many applications, ranking of decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA), especially when there are extremely efficient DMUs. In such cases, many DEA models may usually get the same efficiency score for different DMUs. Hence, there is a growing interest in ranking techniques yet. The main purpose of this paper ...
full textRanking efficient DMUs using the infinity norm and virtual inefficient DMU in DEA
In many applications, ranking of decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA), especially when there are extremely efficient DMUs. In such cases, many DEA models may usually get the same efficiency score for different DMUs. Hence, there is a growing interest in ranking techniques yet. The purpose of this paper is ra...
full textRanking efficient DMUs using the variation coefficient of weights in DEA
One of the difficulties of Data Envelopment Analysis(DEA) is the problem of deciency discriminationamong efficient Decision Making Units(DMUs) and hence, yielding large number of DMUs as efficientones. The main purpose of this paper is to overcome this inability. One of the methods for rankingefficient DMUs is minimizing the Coefficient of Variation (CV) for inputs-outputs weights. In this pape...
full textRanking DMUs by ideal points in the presence of fuzzy and ordinal data
Envelopment Analysis (DEA) is a very eective method to evaluate the relative eciency of decision-making units (DMUs). DEA models divided all DMUs in two categories: ecient and inecientDMUs, and don't able to discriminant between ecient DMUs. On the other hand, the observedvalues of the input and output data in real-life problems are sometimes imprecise or vague, suchas interval data, ordinal da...
full textMy Resources
Journal title
volume 1 issue 2
pages 75- 83
publication date 2013-04-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023